Extensible grids: uniform sampling on a space-filling curve
نویسندگان
چکیده
We study the properties of points in [0, 1]d generated by applying Hilbert’s space-filling curve to uniformly distributed points in [0, 1]. For deterministic sampling we obtain a discrepancy of O(n−1/d) for d ≥ 2. For random stratified sampling, and scrambled van der Corput points, we get a mean squared error of O(n−1−2/d) for integration of Lipshitz continuous integrands, when d ≥ 3. These rates are the same as one gets by sampling on d dimensional grids and they show a deterioration with increasing d. The rate for Lipshitz functions is however best possible at that level of smoothness and is better than plain IID sampling. Unlike grids, space-filling curve sampling provides points at any desired sample size, and the van der Corput version is extensible in n. Additionally we show that certain discontinuous functions with infinite variation in the sense of Hardy and Krause can be integrated with a mean squared error of O(n−1−1/d). It was
منابع مشابه
A direct inversion method for non-uniform quasi-random point sequences
The inversion method is an effective approach for transforming uniform random points according to a given probability density function. In two dimensions, horizontal and vertical displacements are computed successively using a marginal and then all conditional density functions. When quasi-random low-discrepancy points are provided as input, spurious artifacts might appear if the density functi...
متن کاملEfficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves
In this paper an algorithm is presented to store and process fully adaptive computational grids requiring only a minimal amount of memory. The adaptive grid is specified by a recursive bisection of triangular grid cells. The cells are stored and processed in an order specified by the Sierpinski space-filling curve. A sophisticated system of stacks is used to ensure cache-efficient access to the...
متن کاملDigital halftoning algorithm based on random space-filling curve
SUMMARY This letter introduces a new digital halftoning technique based on error diffusion along a random space-filling curve. The purpose of introducing randomness is to erase regular patterns which tend to arise in an image area of uniform intensity. A simple algorithm for generating a random space-filling curve is proposed based on a random spanning tree and maze traversal. Some experimental...
متن کاملLoad Balancing for Adaptively Refined Grids
The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an NP -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed....
متن کاملMemory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves
We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.4549 شماره
صفحات -
تاریخ انتشار 2014